SPGM: A Scalable PaleoGeomorphology Model

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Scalable Approximate Model Counter

Propositional model counting (#SAT), i.e., counting the number of satisfying assignments of a propositional formula, is a problem of significant theoretical and practical interest. Due to the inherent complexity of the problem, approximate model counting, which counts the number of satisfying assignments to within given tolerance and confidence level, was proposed as a practical alternative to ...

متن کامل

Scalable Model Viewing

In this paper we describe a novel approach to displaying complex 3D scenes on architecture that does not have support for 3D graphical display. Our system makes use of distributed graphics, employing a standard workstation as a server. This server communicates with a client via UDP sockets over a LAN link. To minimize network traffic, a compression engine is employed to compress and decompress ...

متن کامل

A Scalable Pricing Model for Bandwidth Allocation

In this paper, we present a scalable pricing model for dynamic bandwidth allocation combined with simulation scenarios that demonstrate different aspects of a scalable service delivery model and at the same time guarantees a good level of resource utilization. The model allows for increasing the revenue while maintaining an acceptable level of quality of service (QoS) for users. Simulation resu...

متن کامل

A new Model for Scalable θ-subsumption

The θ-subsumption test is known to be a bottleneck in Inductive Logic Programming. The state-of-the-art learning systems in this field are hardly scalable. So we introduce a new θ-subsumption algorithm based on an Actor Model, with the aim of being able to decide subsumption on very large clauses. We use Akka, a powerful tool to build distributed actor systems based on the JVM and the Scala lan...

متن کامل

A Scalable Peer-to-Peer Lookup Model

One of the core problems of P2P computing is resource locating. The main research results of determined resource locating algorithms are four distributed hash table algorithms, i.e: CAN, Chord, Pastry and Tapestry. Based on these algorithms , this paper presents a hierarchical and manageable resource locating model (HMRLM)which can provide P2P networks with scalability and manageability.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SoftwareX

سال: 2018

ISSN: 2352-7110

DOI: 10.1016/j.softx.2018.07.005